Non-overlapping Constraints between Convex Polytopes
نویسندگان
چکیده
This paper deals with non-overlapping constraints between convex polytopes. Non-overlapping detection between fixed objects is a fundamental geometric primitive that arises in many applications. However from a constraint perspective it is natural to extend the previous problem to a non-overlapping constraint between two objects for which both positions are not yet fixed. A first contribution is to present theorems for convex polytopes which allow coming up with general necessary conditions for non-overlapping. These theorems can be seen as a generalization of the notion of compulsory part which was introduced in 1984 by Lahrichi and Gondran [6] for managing non-overlapping constraint between rectangles. Finally, a second contribution is to derive from the previous theorems efficient filtering algorithms for two special cases: the non-overlapping constraint between two convex polygons as well as the non-overlapping constraint between d-dimensional boxes.
منابع مشابه
On the Structure of Linear Programs with Overlapping Cardinality Constraints
Cardinality constraints enforce an upper bound on the number of variables that can be nonzero. This article investigates linear programs with cardinality constraints that mutually overlap, i.e., share variables. We present the components of a branch-and-cut solution approach, including new branching rules that exploit the structure of the corresponding conflict hypergraph. We also investigate v...
متن کاملThe Perles-Shephard identity for non-convex polytopes
Using the theory of valuations, we establish a generalization of an identity of Perles-Shephard for non-convex polytopes. By considering spherical valuations, we obtain the Gram-Euler, Descartes and Euler-Poincar e theorems for non-convex polytopes.
متن کاملAsymptotic approximation of smooth convex bodies by general polytopes
For the optimal approximation of convex bodies by inscribed or circumscribed polytopes there are precise asymptotic results with respect to different notions of distance. In this paper we want to derive some results on optimal approximation without restricting the polytopes to be inscribed or circumscribed. Let Pn and P(n) denote the set of polytopes with at most n vertices and n facets, respec...
متن کاملSubgraph polytopes and independence polytopes of count matroids
Given an undirected graph, the non-empty subgraph polytope is the convex hull of the characteristic vectors of pairs (F, S) where S is a nonempty subset of nodes and F is a subset of the edges with both endnodes in S. We obtain a strong relationship between the non-empty subgraph polytope and the spanning forest polytope. We further show that these polytopes provide polynomial size extended for...
متن کاملDomain Triangulation Between Convex Polytopes
In this paper, we propose a method for solving the problem triangulation of a domain between convex polyhedrons in ddimensional space using Delaunay triangulation in O(N) time. Novelty of our work is in using a modified Delaunay triangulation algorithm with constraints.
متن کامل